Resource optimization and (min,+) spectral theory

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource Optimization and (min,+) Spectral Theory

We show that certain resource optimization problems relative to Timed Event Graphs reduce to linear programs. The auxiliary variables which allow this reduction can be interpreted in terms of eigenvectors in the (min,+) algebra. Keywords—Resource Optimization, Timed Event Graphs, (max,+) algebra, spectral theory.

متن کامل

Faster min-max resource sharing in theory and practice

We consider the (block-angular) min-max resource sharing problem, which is defined as follows. Given finite sets R of resources and C of customers, a convex set Bc, called block, and a convex function gc : Bc → R+ for every c ∈ C, the task is to find bc ∈ Bc (c ∈ C) approximately attaining λ∗ := inf{maxr∈R ∑ c∈C(gc(bc))r | bc ∈ Bc(c ∈ C)}. As usual we assume that gc can be computed efficiently ...

متن کامل

Approximate Max-Min Resource Sharing for Structured Concave Optimization

We present a Lagrangian decomposition algorithmwhich uses logarithmic potential reduction to compute an ε-approximate solution of the general max-min resource sharing problem with M nonnegative concave constraints on a convex set B. We show that this algorithm runs in O(M(ε+lnM)) iterations, a data independent bound which is optimal up to polylogarithmic factors for any fixed relative accuracy ...

متن کامل

Resource Allocation with improved Min-Min Algorithm

A distributed system is a software system in which components located on networked computers communicate and coordinate their actions by passing messages. Most of the existing solutions on task scheduling and resource management in distributed computing environment are based on the traditional client/ server model, enforcing a homogeneous policy on making decisions and limiting the flexibility,...

متن کامل

Constrained Renewable Resource Allocation in Fuzzy Metagraphs via Min-Slack

This paper discusses that the fuzzy metagraphs can be used as a tool for scheduling and control of fuzzy projects. Often, available resources for executing projects may be limited. It is assumed the resources required to accomplish each activity of project (metagraph edges) is renewable. One of the common methods for scheduling projects is using the min-slack. So, first, the forward and bac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 1995

ISSN: 0018-9286,1558-2523

DOI: 10.1109/9.471219